package toOffer;

/**
 * @author YuanAo
 * @date 2025/4/14 9:53
 * @description
 */

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

/**
 * 输入：words = ["abcw","baz","foo","bar","fxyz","abcdef"] 输出：16 解释：这两个单词为 "abcw", "fxyz"。它们不包含相同字符，且长度的乘积最大。
 */
public class LCR005 {
    public static void main(String[] args) {
        String[] words = {"abcw", "baz", "foo", "bar", "fxyz", "abcdef"};
        System.out.println(maxProduct(words));
    }

    public static int maxProduct(String[] words) {
        char e = 'a';
        Map<String, Integer> bits = new HashMap<>();
        while (e < 'z'){
            bits.put(Character.toString(e), 0);
            e++;
        }


        return 0;
    }

}
